Network improvement for equilibrium routing

The Network Improvement Problem for Equilibrium Routing

In routing games, agents pick their routes through a network to minimize their own delay. A primary concern for the network designer in routing games is the average agent delay at equilibrium. A number of methods to control this average delay have received substantial attention, including network tolls, Stackelberg routing, and edge removal. A related approach with arguably greater practical re...

Equilibrium routing under uncertainty

Mixed Equilibrium for Multiclass Routing Games

We consider a network shared by noncooperative two types of users, group users and individual users, each user of the first type has a significant impact on the load of the network, whereas a user of the second type doesn’t. Both group users as well as individual users choose their routes so as to minimize their costs. We further consider the case that the users may have side constraints. We st...

application of upfc based on svpwm for power quality improvement

در سالهای اخیر،اختلالات کیفیت توان مهمترین موضوع می باشد که محققان زیادی را برای پیدا کردن راه حلی برای حل آن علاقه مند ساخته است.امروزه کیفیت توان در سیستم قدرت برای مراکز صنعتی،تجاری وکاربردهای بیمارستانی مسئله مهمی می باشد.مشکل ولتاژمثل شرایط افت ولتاژواضافه جریان ناشی از اتصال کوتاه مدار یا وقوع خطا در سیستم بیشتر مورد توجه می باشد. برای مطالعه افت ولتاژ واضافه جریان،محققان زیادی کار کرده ...

Bound Improvement for LNG Inventory Routing

Liquefied Natural Gas (LNG) is steadily becoming a common mode for commercializing natural gas. In this paper, we develop methods for improving both lower and upper bounds for a previously stated form of an LNG inventory routing problem. A Dantzig-Wolfe-based decomposition approach is developed for LNG inventory routing problem (LNG-IRP) attempting to overcome poor lower bounds. However, it fai...